Filter Allocation Using Iterative ECNP

Network devices can filter traffic in order to protect end-user computers against network worms and other threats. Since these devices have very limited memories and cannot deploy filters against every known worm, the traffic can be forwarded to other device during so called filter delegation. In this contribution we present two negotiation based algorithms looking for a good filter delegation solution. We formally describe this filter allocation problem in a network dealing with distribution of filters among agents so that several constraints are fulfilled and we extend this problem to fit a real world task. We show that both the basic problem and its extension are NP-complete. Both algorithms solving this problem are experimentally evaluated on a realistic network simulation.